Finding the gates
نویسندگان
چکیده
منابع مشابه
Bounds on finding triangles (in tiny graphs) with NAND gates
Finding cliques is one problem which has been studied for lower bounds. It’s hard to approximate, and Razborov showed that a monotone (ANDand ORgate) circuit which solves it has exponentially many gates. Therefore, if you’re going to look for lower bounds, it seems like a worthwhile problem to look at. How many (unbounded fan-in) NAND gates are needed to find triangles in an undirected graph? H...
متن کاملOn Finding Sensitivity of Quantum and Classical Gates
We consider a fault model of Boolean gates, both classical and quantum, where some of the inputs may not be connected to the actual gate hardware. This model is somewhat similar to the stuck-at model which is a very popular model in testing Boolean circuits. We consider the problem of detecting such faults; the detection algorithm can query the faulty gate and its complexity is the number of su...
متن کاملGates
Gates are a new notation for representing mixture models and context-sensitive independence in factor graphs. Factor graphs provide a natural representation for message-passing algorithms, such as expectation propagation. However, message passing in mixture models is not well captured by factor graphs unless the entire mixture is represented by one factor, because the message equations have a c...
متن کاملThe gates of memory
GEOFFREY KEYNES, The gates ofmemory, Oxford, Clarendon Press, 1981, 8vo, pp. xi, 428, illus., £12.50. An autobiographer unveiling his self-portrait can pick an excuse from a wide variety, ranging from the sincere attempt to entertain his friends to a sackcloth-and-ashes apologia pro sua vita. Sir Geoffrey Keynes, by borrowing from Blake his title, invites us to look upon his real self, a self t...
متن کاملFinding a robust assignment of flights to gates at Amsterdam Airport Schiphol
In this paper we investigate the gate assignment problem as it appears at Amsterdam Airport Schiphol (AAS). Currently, the gate planners spend many hours on adjusting the automatically generated planning during the day of operation to make it proof against small deviations from the schedule. To alleviate this problem, we aim at finding a robust solution, given the planned arrivals and departure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 2019
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.365.6451.338-e